全文获取类型
收费全文 | 832篇 |
免费 | 34篇 |
国内免费 | 41篇 |
专业分类
化学 | 43篇 |
晶体学 | 1篇 |
力学 | 30篇 |
综合类 | 27篇 |
数学 | 748篇 |
物理学 | 58篇 |
出版年
2023年 | 13篇 |
2022年 | 12篇 |
2021年 | 14篇 |
2020年 | 18篇 |
2019年 | 17篇 |
2018年 | 19篇 |
2017年 | 12篇 |
2016年 | 13篇 |
2015年 | 13篇 |
2014年 | 37篇 |
2013年 | 89篇 |
2012年 | 30篇 |
2011年 | 64篇 |
2010年 | 37篇 |
2009年 | 69篇 |
2008年 | 62篇 |
2007年 | 54篇 |
2006年 | 44篇 |
2005年 | 31篇 |
2004年 | 32篇 |
2003年 | 30篇 |
2002年 | 29篇 |
2001年 | 20篇 |
2000年 | 21篇 |
1999年 | 19篇 |
1998年 | 14篇 |
1997年 | 11篇 |
1996年 | 15篇 |
1995年 | 9篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有907条查询结果,搜索用时 31 毫秒
11.
侯旻 《新疆大学学报(理工版)》1991,(1)
本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。 相似文献
12.
本文建立了两个Toeplitz矩阵之积仍为Toeplitz矩阵的一个充分必要条件,由此也立即获得了循环矩阵的乘积及其逆也是循环矩阵的已知结果。 相似文献
13.
Iddo Eliazar 《Queueing Systems》2007,55(1):71-82
We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated.
We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied
to various examples, including ones with infinite queues and non-summable workloads.
AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10 相似文献
14.
讨论具有无穷时滞中立型泛函微分方程$ \frac{\rm d}{{\rm d}t}\left(x(t)-\int_{-\infty}^{0}g(s,x(t+s)){\rm d}s\right) =A(t,x(t))x(t)+f(t,x_t)$的周期解问题,利用重合度理论中的延拓定理得到了周期解的存在性和唯一性条件;特别地,当$g(s,x)\equiv 0, A(t,x)=A(t)$时, 给出了存在唯一稳定周期解的条件. 相似文献
15.
Atsushi Yamagami 《Journal of Number Theory》2003,99(1):120-138
In this article, for a residual modular representation defined over an arbitrary finite field, Gouvêa's conjecture which says that the universal deformation ring is isomorphic to a certain Hecke algebra is proven in the unobstructed case. 相似文献
16.
The predictive accuracy for estimating infinite dilution activity coefficients by a modification of the UNIFAC method wherein the group interaction parameters were based on only data (referred to as -based UNIFAC) has been studied. Estimates and measured values were compared for six prototypical solutes in a series of homologous n-alkanes, l-alcohols and alkanenitrile solvents. Despite the fact that the interaction parameters were derived using only data, this approach still gave serious errors due to several inherent problems in the original UNIFAC model. Its performance is sometimes even poorer than that of the original UNIFAC method. For example for nitromethane in alcohols and p-dioxane in nitriles values predicted by the -based UNIFAC are essentially zero. The large errors for these systems are most likely due to inaccurate interaction parameters in the -based UNIFAC method. 相似文献
17.
《Operations Research Letters》2022,50(6):655-659
In finite graphs, greedy algorithms are used to find minimum spanning trees (MinST) and maximum spanning trees (MaxST). In infinite graphs, we illustrate a general class of problems where a greedy approach discovers a MaxST while a MinST may be unreachable. Our algorithm is a natural extension of Prim's to infinite graphs with summable and strictly positive edge weights, producing a sequence of finite trees that converge to a MaxST. 相似文献
18.
一类空间分数阶扩散方程经过有限差分离散后所得到的离散线性方程组的系数矩阵是两个对角矩阵与Toeplitz型矩阵的乘积之和.在本文中,对于几乎各向同性的二维或三维空间分数阶扩散方程的离散线性方程组,采用预处理Krylov子空间迭代方法,我们利用其系数矩阵的特殊结构和具体性质构造了一类分块快速正则Hermite分裂预处理子.通过理论分析,我们证明了所对应的预处理矩阵的特征值大部分都聚集于1的附近.数值实验也表明,这类分块快速正则Hermite分裂预处理子可以明显地加快广义极小残量(GMRES)方法和稳定化的双共轭梯度(BiCGSTAB)方法等Krylov子空间迭代方法的收敛速度. 相似文献
19.
Least squares estimations have been used extensively in many applications, e.g. system identification and signal prediction. When the stochastic process is stationary, the least squares estimators can be found by solving a Toeplitz or near-Toeplitz matrix system depending on the knowledge of the data statistics. In this paper, we employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Our proposed circulant preconditioners are derived from the spectral property of the given stationary process. In the case where the spectral density functions() of the process is known, we prove that ifs() is a positive continuous function, then the spectrum of the preconditioned system will be clustered around 1 and the method converges superlinearly. However, if the statistics of the process is unknown, then we prove that with probability 1, the spectrum of the preconditioned system is still clustered around 1 provided that large data samples are taken. For finite impulse response (FIR) system identification problems, our numerical results show that annth order least squares estimator can usually be obtained inO(n logn) operations whenO(n) data samples are used. Finally, we remark that our algorithm can be modified to suit the applications of recursive least squares computations with the proper use of sliding window method arising in signal processing applications.Research supported in part by HKRGC grant no. 221600070, ONR contract no. N00014-90-J-1695 and DOE grant no. DE-FG03-87ER25037. 相似文献
20.
Xiao-Qing Jin 《BIT Numerical Mathematics》1996,36(1):101-109
We study methods for solving the constrained and weighted least squares problem min
x
by the preconditioned conjugate gradient (PCG) method. HereW = diag (1, ,
m
) with 1
m
0, andA
T
= [T
1
T
, ,T
k
T
] with Toeplitz blocksT
l
R
n × n
,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A
T
= 0, whereM =W
–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E. 相似文献